package algorithm.leetcode;

import java.util.PriorityQueue;

public class LeetCode_1046_lastStoneWeight {
    public int lastStoneWeight(int[] stones) {
//        PriorityQueue queue = new PriorityQueue((o1 , o2)->{});
        return 0;
    }

    public static void main(String[] args) {

    }
}
